Matroid theory

Results: 338



#Item
41Operations research / Linear programming / Convex optimization / Combinatorial optimization / Computational complexity theory / Submodular set function / Randomized rounding / Optimization problem / Matroid / Ellipsoid method / Mathematical optimization / Mechanism design

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

Add to Reading List

Source URL: www-bcf.usc.edu

Language: English - Date: 2011-10-07 01:19:59
42Matroid theory / Matroid / Weighted matroid / Gammoid / Matroid representation / Matroid minor

A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids Jose´ A. Soto Department of Mathematics M.I.T.

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:22
43Graph coloring / Polynomials / Complexity classes / Matroid theory / Tutte polynomial / Chromatic polynomial / K-edge-connected graph / Matroid / Expander graph / NC

c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16.  DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2004-03-11 06:32:34
44Graph theory / Mathematics / Graph connectivity / Spanning tree / Matroid theory / Pseudoforest / Graph / Tree / Connected component / Adjacency matrix / Degree / K-connectivity certificate

Programming Techniques G.K. Manacher Editor

Add to Reading List

Source URL: www.ifp.illinois.edu

Language: English - Date: 2003-07-08 17:11:15
45Mathematics / Mathematical optimization / Combinatorial optimization / Combinatorics / Greedy algorithm / Matroid theory / Assignment problem / Robot / Algorithm / Pareto efficiency / IranOpen / Fair item assignment

In RoboCup 2003: Robot Soccer World Cup VII, LNCS VolDaniel Polani, et al., eds, pages 43-53, Springer-Verlag, Berlin Heidelberg, 2004 On role allocation in RoboCup? Brian P. Gerkey1 and Maja J Matari´c2 1

Add to Reading List

Source URL: robotics.stanford.edu

Language: English - Date: 2005-04-19 17:12:56
46Mathematics / NP-complete problems / Combinatorics / Discrete mathematics / Operations research / Theoretical computer science / Combinatorial optimization / Greedy algorithm / Matroid theory / Robotics / Robot / Assignment problem

In Intl. J. of Robotics Research 23(9):, September2004 A formal analysis and taxonomy of task allocation in multi-robot systems Brian P. Gerkey Artificial Intelligence Lab

Add to Reading List

Source URL: robotics.stanford.edu

Language: English - Date: 2004-09-08 19:38:27
47Graph theory / Mathematics / Matroid theory / Matching / Combinatorial optimization / Bipartite graph / Maximum flow problem / Degree / Connectivity / Ear decomposition / HopcroftKarp algorithm / Expander graph

1 Optimality of Fast Matching Algorithms for Random Networks with Applications to Structural Controllability Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis

Add to Reading List

Source URL: dept.stat.lsa.umich.edu

Language: English - Date: 2016-04-09 11:17:17
48Mathematics / Numerical analysis / Algebra / Statistical classification / Data mining / Linear algebra / Greedy algorithm / Matroid theory / Support vector machine / Cluster analysis / Algorithm / Regularized least squares

Feature Clustering for Accelerating Parallel Coordinate Descent Chad Scherrer Independent Consultant Yakima, WA

Add to Reading List

Source URL: dept.stat.lsa.umich.edu

Language: English - Date: 2013-01-18 21:24:37
49Graph theory / Mathematics / Constraint programming / Matroid theory / Ear decomposition / Graph / Spanning tree / Decomposition method / Local consistency

September 20, :54 WSPC - Proceedings Trim Size: 9.75in x 6.5in

Add to Reading List

Source URL: www.jsbi.org

Language: English - Date: 2008-01-07 20:56:23
50Mathematics / NP-complete problems / Combinatorics / Discrete mathematics / Greedy algorithm / Matroid theory / Set cover problem / Algorithm / Combinatorial optimization

How to Grow More Pairs: Suggesting Review Targets For Comparison-Friendly Review Ecosystems James Cook ∗ UC Berkeley

Add to Reading List

Source URL: www2013.wwwconference.org

Language: English - Date: 2014-07-21 08:47:06
UPDATE